Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size
نویسندگان
چکیده
In this paper, we address two key aspects of solving methods based on tree-decomposition. First, we propose an algorithm computing decompositions that allows to bound the size of separators, which is a crucial parameter to limit the space complexity, and thus the feasibility of such methods. Moreover, we show how it is possible to dynamically modify the considered decomposition during the search. This dynamic modification can offer more freedom to the variable ordering heuristics. This also allows to better use the information gained during the search while controlling the size of the required memory.
منابع مشابه
Dynamic heuristics for branch and bound search on tree-decomposition of Weighted CSPs
This paper deals with methods exploiting tree-decomposition approaches for solving weighted constraint networks. We consider here the practical efficiency of these approaches by defining three classes of variable orders more and more dynamic which preserve the time complexity bound. Then, we extend this theoretical time complexity bound to increase the dynamic aspect of these orders. For that, ...
متن کاملDynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs
This paper deals with methods exploiting treedecomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining five classes of variable orders more and more dynamic which preserve the time complexity bound. For that, we define extensions of this theoretical time complexity bound to increase the dynamic aspect of these orders. We ...
متن کاملComputer Simulation of Particle Size Classification in Air Separators
Cement powder size classification efficiency significantly affects quality of final product and extent of energy consumption in clinker grinding circuits. Static and dynamic or high efficiency air separators are being used widely in closed circuit with multi-compartment tube ball mills, High Pressure Grinding Rolls (HPGR) and more recently Vertical Roller Mills (VRM) units in cement plants ...
متن کاملOptimization on Seperator Trees
Given a chordal graph G, and a class of subgraphs H of G, we investigate the problem of finding an element H ∈ H which minimizes a function f : H → R. We show that when f satisfies a decomposability criterion, and when H admits what we call an efficiently decomposable configuration space with respect to f , then this optimization problem can be solved in polynomial time. We give a dynamic progr...
متن کاملTabu Search for Generalized Hypertree Decompositions
Many important real world problems can be formulated as Constraint Satisfaction Problems (CSPs). A CSP consists of a set of variables each with a domain of possible values, and a set of constraints on the allowed values for specified subsets of variables. A solution to CSP is the assignment of values to variables, such that no constraint is violated. CSPs include many NP-complete problems and a...
متن کامل